A Refutation of the Commodity Exploitation Theorem
نویسندگان
چکیده
This note is to show that the generalized commodity exploitation theorem put forward by Bowles and Gintis (1981) and Roemer (1982, 1986) is nothing but an alternative form of the Hawkins-Simon condition for a given technical data, and that it has nothing to do with exploitation. That is, the Hawkins-Simon condition means a mere possibility of an economic system to produce a surplus in each commodity, and as such does not guarantee the existence of positive profits. To consider exploitation or the existence of positive profits, we need to introduce prices at which unequal exchanges may be carried out. One more point is that labour is reproduced in a process which is supposed to earn no profit.
منابع مشابه
From Refutation to Verification
Model checking has won some industrial acceptance in debugging designs. Theorem proving and formal verification are less popular. An approach built around automated abstractions could integrate theorem proving with model checking in an acceptable way and provide a bridge between refutation and verification.
متن کاملRefutation of Richard Gill’s Argument Against my Disproof of Bell’s Theorem
I identify a number of errors in Richard Gill’s purported refutation of my disproof of Bell’s theorem. In particular, I point out that his central argument is based, not only on a rather trivial misreading of my counterexample to Bell’s theorem, but also on a simple oversight of a freedom of choice in the orientation of a Clifford algebra. What is innovative and original in my counterexample is...
متن کاملFirst-Order Logic Theorem Proving via Counterexample-Guided Abstraction Refinement
Counterexample-guided abstraction refinement is a well-established technique in verification. In this paper we instantiate the idea for firstorder logic theorem proving. Given a clause set N we propose its abstraction into a clause set N ′ belonging to a decidable first-order fragment. The abstraction preserves satisfiability: if N ′ is satisfiable, so is N . A refutation in N ′ can then either...
متن کاملRewrite-Based Equational Theorem Proving with Selection and Simplification
We present various refutationally complete calculi for first-order clauses with equality that allow for arbitrary selection of negative atoms in clauses. Refutation completeness is established via the use of well-founded orderings on clauses for defining a Herbrand model for a consistent set of clauses. We also formulate an abstract notion of redundancy and show that the deletion of redundant c...
متن کاملFirst-Order Logic Theorem Proving and Model Building via Approximation and Instantiation
In this paper we consider first-order logic theorem proving and model building via approximation and instantiation. Given a clause set we propose its approximation into a simplified clause set where satisfiability is decidable. The approximation extends the signature and preserves unsatisfiability: if the simplified clause set is satisfiable in some model, so is the original clause set in the s...
متن کامل